#include<bits/stdc++.h>
#define ll long long
#define mid ((l+r)>>1)
using namespace std;
namespace IO{
    char buff[1<<21],*p1=buff,*p2=buff;
    char getch(){
        return p1==p2&&(p2=((p1=buff)+fread(buff,1,1<<21,stdin)),p1==p2)?EOF:*p1++;
    }
    template<typename T>
    void read(T &x){
        char ch=getch();int fl=1;x=0;
        while(ch>'9'||ch<'0'){if(ch=='-')fl=-1;ch=getch();}
        while(ch<='9'&&ch>='0'){x=x*10+ch-48;ch=getch();}
        x*=fl;
    }
    template<typename T,typename ...Args>
    void read(T &x,Args& ...args){
        read(x);read(args...);
    }
    char obuf[1<<21],*p3=obuf;
    void putch(char ch){
        if(p3-obuf<(1<<21))*p3++=ch;
        else fwrite(obuf,p3-obuf,1,stdout),p3=obuf,*p3++=ch;
    }
    void pc(const char *s){
    	while(*s)putch(*s),s++;
    }
    char ch[100];
    template<typename T>
    void write(T x){
        if(!x)return putch('0');
        if(x<0)putch('-'),x*=-1;
        int top=0;
        while(x)ch[++top]=x%10+48,x/=10;
        while(top)putch(ch[top]),top--;
    }
    template<typename T,typename ...Args>
    void write(T x,Args ...args){
        write(x),putch(' '),write(args...);
    }
    void flush(){fwrite(obuf,p3-obuf,1,stdout);}
}
using namespace IO;
const int N=2e5+5,mod=998244353;
inline int Mod(int x){return x>=mod?x-mod:x;}
int n;
int a[N],b[N],c[N];
vector<__int128>f[N];
bool check(){
	for(int i=1;i<n;i++)if(c[i]!=1)return 0;
	return 1;
}
signed main(){
	freopen("b.in","r",stdin);
	freopen("b.out","w",stdout);
	read(n); 
	for(int i=1;i<=n;i++)read(a[i]);
	for(int i=1;i<=n;i++)read(b[i]);
	for(int i=1;i<n;i++)read(c[i]);
	if(check()){
		int ans=0;
		int maxn=0;
		for(int i=n;i>=1;i--){
			maxn=max(maxn,a[i]);
			ans=Mod(ans+1ll*maxn*b[i]%mod);
		}
		write(ans);
		return flush(),0;
	}
	f[1].resize(1);
	ll sum=0;
	for(int i=1;i<n;i++){
		sum+=b[i];
		f[i+1].resize(min(sum/c[i],90000ll)+1);
		sum/=c[i];
	}
	for(int i=0;i<f[n].size();i++)f[n][i]=1ll*a[n]*(b[n]+i);
	for(int i=n-1;i>=1;i--){
		int len=f[i].size()-1;
		for(int k=0;1ll*k*c[i]<=len+b[i];k++){
			int j=max(0,k*c[i]-b[i]);
			f[i][j]=max(f[i][j],f[i+1][k]-(__int128)k*c[i]*a[i]+1ll*a[i]*(b[i]+j));
		}
		for(int j=1;j<=len;j++)
			f[i][j]=max(f[i][j],f[i][j-1]+a[i]);
	}
	f[1][0]%=mod;
	write(f[1][0]);
	return flush(),0;
}

